Vague Domains, S-Unification and Logic Programming
نویسندگان
چکیده
منابع مشابه
A Unification-Free Introduction to Logic Programming
In this paper, we give a new presentation of the fundamental results of the theory of Logic Programming, which differs from classical introductions in at least two ways: the use of predicate algebras to deal with model theoretical aspects and the parameterization of the resolution algorithm with respect to the specific unification algorithm implemented. In our opinion, the search for an elegant...
متن کاملA Logic Programming Framework for Possibilistic Argumentation with Vague Knowledge
Defeasible argumentation frameworks have evolved to become a sound setting to formalize commonsense, qualitative reasoning from incomplete and potentially inconsistent knowledge. Defeasible Logic Programming (DeLP) is a defeasible argumentation formalism based on an extension of logic programming. Although DeLP has been successfully integrated in a number of different real-world applications, D...
متن کاملClausal Logic and Logic Programming in Coherent Domains
Synopsis. We introduce a domain-theoretic foundation for disjunctive logic programming. This foundation is built on clausal logic, a representation of the Smyth powerdomain of a coherent algebraic dcpo. The robustness of this approach comes from the agreement bewteen the declarative semantics and the xed-point semantics, as well as the agreement between the xed-point semantics and the semantics...
متن کاملClausal Logic and Logic Programming in Algebraic Domains
We introduce a domain-theoretic foundation for disjunctive logic programming. This foundation is built on clausal logic, a representation of the Smyth powerdomain of any coherent algebraic dcpo. We establish the completeness of a resolution rule for inference in such a clausal logic; we introduce a natural declarative semantics and a fixed-point semantics for disjunctive logic programs, and pro...
متن کاملUnitary Unification of S 5 Modal Logic and Its Extensions
It is shown that all extensions of S5 modal logic, both in the standard formalization and in the formalization with strict implication, as well as all varieties of monadic algebras have unitary unification.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2002
ISSN: 1571-0661
DOI: 10.1016/s1571-0661(04)80516-4